The Geometry of Two-weight Codes
نویسندگان
چکیده
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, /»„ /»,) sets in PG(£— \,q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples.
منابع مشابه
The Geometry of Homogeneous Two-Weight Codes
The results of [1, 2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1, 2]. Secondly, these codes are used to define a dual two-weight code and strongly regular graph similar to the classical case of projective linear two-weight code...
متن کاملOn construction and generalization of algebraic geometry codes
The construction, estimation of minimum distance, and decoding algorithms of algebraic geometry codes can be explained without using advanced mathematics by the notion of weight domains. We clarify the relation between algebraic geometry codes and linear codes from weight domains. Then we review a systematic construction which yields all weight domains.
متن کاملAn Introduction to Algebraic Geometry codes
We present an introduction to the theory of algebraic geometry codes. Starting from evaluation codes and codes from order and weight functions, special attention is given to one-point codes and, in particular, to the family of Castle codes.
متن کاملMinimum Weight and Dimension Formulas for Some Geometric Codes
The geometric codes are the duals of the codes defined by the designs associated with finite geometries. The latter are generalized Reed-Muller codes, but the geometric codes are, in general, not. We obtain values for the minimum weight of these codes in the binary case, using geometric constructions in the associated geometries, and the BCH bound from coding theory. Using Hamada’s formula, we ...
متن کاملMinimum weight for some binary geometric codes
The geometric codes are the orthogonals of the codes defined by the designs associated with finite geometries. The latter are generalized Reed-Muller codes, but the geometric codes are, in general, not. We obtain values for the minimum weight of these codes in the binary case, using geometric constructions in the associated geometries, and the BCH bound from coding theory. Using Hamada’s formul...
متن کامل